Largest Bounding Box, Smallest Diameter, and Related Problems on Imprecise Points
نویسندگان
چکیده
We model imprecise points as regions in which one point must be located. We study computing the largest and smallest possible values of various basic geometric measures on sets of imprecise points, such as the diameter, width, closest pair, smallest enclosing circle, and smallest enclosing bounding box. We give efficient algorithms for most of these problems, and identify the hardness of others.
منابع مشابه
Basic Measures for Imprecise Point Sets in R
Most algorithms in computational geometry tend to assume that all input is exact, with no imprecision or error. Most real-world data however, has some imprecision (for example due to measurement error). Thus, there exists a need for algorithms that can produce meaningful output for imprecise input data. In this thesis, I present results on the computation of upper and lower bounds on various ba...
متن کاملSome Geometric Problems on OMTSE Optoelectronic Computer
Optical Multi-Trees with Shuffle Exchange (OMTSE) architecture is an efficient model of an optoelectronic computer. The network has a total of 3n/2 nodes. The diameter and bisection width of the network are 6 logn − 1 and n/4 respectively. In this note, we present synchronous SIMD algorithms on an OMTSE optoelectronic computer for the following problems in computational geometry: Convex Hull, S...
متن کاملComputational Geometry On The OTIS-Mesh Optoelectronic Computer
We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and closest-pair—on the OTIS-Mesh optoelectronic computer. We also demonstrate the algorithms for computing convex hull and prefix sum with condition on a multi-dimensional mesh, which are used to compute convex hull and ECDF ...
متن کاملLargest and Smallest Area Triangles on a Given Set of Imprecise Points
In this paper we study the following problem: we are given a set of imprecise points modeled as parallel line segments, and we wish to place a point on each line segment such that the resulting point set maximizes/minimizes the size of the largest/smallest area k-gon. We first study the problem for the case k = 3. We show that for a given set of parallel line segments of equal length the larges...
متن کاملA New Algorithm and Open Problems in Three-Dimensional Orthogonal Graph Drawing
In this paper we present an algorithm for 3-D orthogonal drawing of arbitrary degree n-vertex m-edge multigraphs with O(m 2 = p n) bounding box volume and 6 bends per edge route. This is the smallest known bound on the bounding box volume of 3-D orthogonal multigraph drawings. We continue the study of the tradeoo between bounding box volume and the number of bends in orthogonal graph drawings t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 43 شماره
صفحات -
تاریخ انتشار 2007